An Empirical Comparison of the Hardness of Multi-Agent Path Finding under the Makespan and the Sum of Costs Objectives
نویسندگان
چکیده
In the multi-agent path finding (MAPF) the task is to find non-conflicting paths for multiple agents. Recently, existing makespan optimal SAT-based solvers for MAPF have been modified for the sum-of-costs objective. In this paper, we empirically compare the hardness of solving MAPF with SATbased and search-based solvers under the makespan and the sum-of-costs objectives in a number of domains. The experimental evaluation shows that MAPF under the makespan objective is easier across all the tested solvers and domains.
منابع مشابه
Boolean Satisfiability Approach to Optimal Multi-agent Path Finding under the Sum of Costs Objective: (Extended Abstract)
This paper focuses on finding optimal solutions to the multiagent path finding (MAPF) problem over undirected graphs where the task is to find non-colliding paths for multiple agents, each with a different start and goal position. An encoding of MAPF to Boolean satisfiability (SAT) is already known to the makespan optimal variant of the problem. In this paper we present the first SAT-solver for...
متن کاملEfficient SAT Approach to Multi-Agent Path Finding Under the Sum of Costs Objective
In the multi-agent path finding (MAPF) the task is to find non-conflicting paths for multiple agents. In this paper we present the first SAT-solver for the sum-of-costs variant of MAPF which was previously only solved by search-based methods. Using both a lower bound on the sum-of-costs and an upper bound on the makespan, we are able to have a reasonable number of variables in our SAT encoding....
متن کاملAgent-based approach for cooperative scheduling
This paper studies the multi-factory production (MFP) network scheduling problem where a number of different individual factories join together to form a MFP network, in which these factories can operate more economically than operating individually. However, in such network which known as virtual production network with self-interested factories with transportation times, each individual facto...
متن کاملFinding the Optimal Path to Restoration Loads of Power Distribution Network by Hybrid GA-BCO Algorithms Under Fault and Fuzzy Objective Functions with Load Variations
In this paper proposes a fuzzy multi-objective hybrid Genetic and Bee colony optimization algorithm(GA-BCO) to find the optimal restoration of loads of power distribution network under fault.Restoration of distribution systems is a complex combinatorial optimization problem that should beefficiently restored in reasonable time. To improve the efficiency of restoration and facilitate theactivity...
متن کاملAn Online Q-learning Based Multi-Agent LFC for a Multi-Area Multi-Source Power System Including Distributed Energy Resources
This paper presents an online two-stage Q-learning based multi-agent (MA) controller for load frequency control (LFC) in an interconnected multi-area multi-source power system integrated with distributed energy resources (DERs). The proposed control strategy consists of two stages. The first stage is employed a PID controller which its parameters are designed using sine cosine optimization (SCO...
متن کامل